The Canonical Formulae

نویسنده

  • Andrzej Trybulec
چکیده

(4) For every function yielding function f holds Subf rng f = rng f . (5) For all sets A, B, x and for every function f such that x ∈ A and f ∈ BA holds f (x) ∈ B. (6) For all sets A, B, C such that if C = / 0, then B = / 0 or A = / 0 and for every function f from A into CB holds domκ f (κ) = A 7−→ B. Let us mention that / 0 is function yielding. In the sequel n denotes a natural number and p, q, r denote elements of HP-WFF. The following proposition is true

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elementary canonical formulae: extending Sahlqvist's theorem

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of mi...

متن کامل

Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Model?theoretic Aspects

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called can...

متن کامل

The Canonical Forms of Logical Formulae over the Data Types and Their Using in Programs Verification

A brief review and the results of working with tools for the formulae simplifying are presented. The algorithm for constructing the canonical forms of linear semi-algebraic formulae over the enumerated and multiple types is described.

متن کامل

Sampling in the Linear Canonical Transform Domain

This paper investigates the interpolation formulae and the sampling theorem for bandpass signals in the linear canonical transform LCT domain. Firstly, one of the important relationships between the bandpass signals in the Fourier domain and the bandpass signals in the LCT domain is derived. Secondly, two interpolation formulae from uniformly sampled points at half of the sampling rate associat...

متن کامل

Non-Denumerable Infinitary Modal Logic

Segerberg established an analogue of the canonical model theorem in modal logic for infinitary modal logic. However, the logics studied by Segerberg and Goldblatt are based on denumerable sets of pairs 〈Γ, α〉 of sets Γ of well-formed formulae and well-formed formulae α. In this paper I show how a generalisation of the infinite cut-rule used by Segerberg and Goldblatt enables the removal of the ...

متن کامل

Poisson–Lie T–plurality as canonical transformation

We generalize the prescription realizing classical Poisson–Lie T–duality as canonical transformation to Poisson–Lie T–plurality. The key ingredient is the transformation of left–invariant fields under Poisson–Lie T–plurality. Explicit formulae realizing canonical transformation are presented and the preservation of canonical Poisson brackets and Hamiltonian density is shown. PACS: 02.30.Ik, 04....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004